How Not to Combine Modal Logics
نویسندگان
چکیده
This paper describes a failed attempt to decompose the fusion of two non-normal modal logics as a composition of iterated nonnormal modalisations. That strategy had already succeeded in the transfer of soundness, completeness and decidability for normal modal logics, but we show here why it fails for the transference of some of these properties in the fusion non-normal modal logics. The possibility of the transference of these properties is not ruled out by this result. We also show that the fusion of some of the more common non-normal modal logics transfers completeness, relying directly on the properties of each of the component modal logics.
منابع مشابه
Combining Possibilities and Negations
Combining non-classical or`sub-classical' logics is not easy, but it is very interesting. In this paper, we combine nonclassical logics of negation and possibility in the presence of conjunction and disjunction, and then we combine the resulting systems with intuitionistic logic. We will nd that Kracht's results on the undecidability o f classical modal logics generalise to a non-classical sett...
متن کاملLabelled Tableaux for Multi-Modal Logics
In this paper we present a tableau-like proof system for multi-modal logics based on D’Agostino and Mondadori’s classical refutation system KE [DM94]. The proposed system, that we call KEM , works for the logics S5A and S5P(n) which have been devised by Mayer and van der Hoek [MvH92] for formalizing the notions of actuality and preference. We shall also show howKEM works with the normal modal l...
متن کاملAutomating Access Control Logics in Simple Type Theory with LEO-II
Garg and Abadi recently proved that prominent access control logics can be translated in a sound and complete way into modal logic S4. We have previously outlined how normal multimodal logics, including monomodal logics K and S4, can be embedded in simple type theory and we have demonstrated that the higher-order theorem prover LEO-II can automate reasoning in and about them. In this paper we c...
متن کاملA Fibred Tableau Calculus for Modal Logics of Agents
In [15,19] we showed how to combine propositional multimodal logics using Gabbay’s fibring methodology. In this paper we extend the above mentioned works by providing a tableau-based proof technique for the combined/fibred logics. To achieve this end we first make a comparison between two types of tableau proof systems, (graph & path), with the help of a scenario (The Friend’s Puzzle). Having d...
متن کاملCoLoSS : The Coalgebraic Logic Satisfiability Solver ( System Description ) Georgel Calin
CoLoSS, the Coalgebraic Logic Satisfiability Solver, decides satisfiability of modal formulas in a generic and compositional way. It implements a uniform polynomial space algorithm to decide satisfiability for modal logics that are amenable to coalgebraic semantics. This includes e.g. the logics K, KD, Pauly’s coalition logic, graded modal logic, and probabilistic modal logic. Logics are easily...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005